A Genetic Algorithm with Hill Climbing for the Bandwidth Minimization Problem
نویسندگان
چکیده
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Many algorithms for this problem have been developed, including the wellknown CM and GPS algorithms. Recently, Marti et al., used Tabu Search and Pinana et al. used GRASP with Path Relinking, separately, where both approaches outperformed the GPS algorithm. In this work, our approach is to exploit the Genetic Algorithm technique in global search while using Hill Climbing for local search. Experiments show that this approach achieves the best solution quality when compared with the GPS algorithm, Tabu Search, and the GRASP with Path Relinking methods, while being faster than the latter two newly-developed heuristics.
منابع مشابه
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Experiments show that this approach achieves the best solution quality when compared with the GPS [1] algorithm, Tabu ...
متن کاملA Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملLevel-based heuristics and hill climbing for the antibandwidth maximization problem
The antibandwidth maximization problem aims to maximize the minimum distance of entries of a sparse symmetric matrix from the diagonal and as such may be regarded as the dual of the well-known bandwidth minimization problem. In this paper, we consider the feasibility of adapting heuristic algorithms for the bandwidth minimization problem to the antibandwidth maximization problem. In particular,...
متن کاملAnt colony optimization with hill climbing for the bandwidth minimization problem
In this work, the problem of reducing the bandwidth of sparse matrices by permuting rows and columns is addressed and solved using a hybrid ant system to generate high-quality renumbering which is refined by a hill climbing local search heuristic. Computational experiments compare the algorithm with the well-known GPS algorithm, as well as recently proposed methods. These show the new approach ...
متن کامل